Finite-Length Scaling for Polar Codes
نویسندگان
چکیده
منابع مشابه
Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes
Consider communication over the binary erasure channel BEC(ǫ) using random low-density parity-check codes with finite-blocklength n from ‘standard’ ensembles. We show that large error events is conveniently described within a scaling theory, and explain how to estimate heuristically their effect. Among other quantities, we consider the finite length threshold ǫ∗(n), defined by requiring a block...
متن کاملOn the Analysis of Puncturing for Finite-Length Polar Codes: Boolean Function Approach
This paper investigates the impact of puncturing on finite-length polar codes in which a puncturing pattern p = (p0, ..., pN ) is applied to a length-N polar code.. We first introduce two virtual channels to stochastically model the punctured (untransmitted) bits, which are respectively called useless channel model (UCM) and deterministic channel model (DCM). Under each model, we derive boolean...
متن کاملFinite-Length Scaling for Gallager A
We consider LDPC codes, transmission over the binary symmetric channel (BSC), and decoding using Gallager’s algorithm A. For those ensembles whose threshold is determined by the behavior of the algorithm at the beginning of the decoding process we derive a scaling law. This scaling law has the same form as the scaling law which was established for the the case of transmission over the binary er...
متن کاملOn Infinitary Finite Length Codes
For a code CcX* the following four conditions are considered: (i) for ail words u, v, in X* and for every word w in C*, wu, uv, vu in C* imply u, v in C*. (ii) every onesided infinité product of words of C is unambiguous. (Ui) C has flnite decoding delay. (iv) C has bounded decoding delay. lt is shown that in gênerai (iv) —> (Ui) —• (ii) -* (ï), and the reverse implications are not true; wherea...
متن کاملFinite-length scaling of collapsing directed walks.
We study the finite length scaling of self–interacting partially directed self–avoiding walks utilising enumeration data up to a total length of 6000 steps. This facilitates the evaluation of the numerical techniques available for calculating exponents at the θ point and in the collapsed phase of walk–type models. Another consequence is the conjecture of a new scaling theory for the collapsed r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2341919